Triangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
نویسندگان
چکیده
منابع مشابه
Triangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model. Detection of possible intersection between objects can be based on the objects’ boundaries (i.e., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection...
متن کاملAn Implementation of Triangle-Triangle Intersection for Qualitative Spatial Reasoning
The intersection between 3D objects is ubiquitous in modeling. The objects are represented using the Boundary Representation (ANSI Brep) model in many applications such as CAD/CAM, collision detection, and spatial reasoning. Detection of possible intersection between objects can be based on the objects’ boundaries (approximate triangulations), computing triangle-triangle intersection. Usually t...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملFaster Triangle-Triangle Intersection Tests
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Key-words: geometric predicates, low degree pr...
متن کاملA Fast Triangle-Triangle Intersection Test
This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used in, for example, collision detection algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polibits
سال: 2013
ISSN: 2395-8618,1870-9044
DOI: 10.17562/pb-48-2